Proof-irrelevant model of CC with predicative induction and judgmental equality
نویسندگان
چکیده
منابع مشابه
Proof-irrelevant model of CC with predicative induction and judgmental equality
We present a set-theoretic, proof-irrelevant model for Calculus of Constructions (CC) with predicative induction and judgmental equality in Zermelo-Fraenkel set theory with an axiom for countably many inaccessible cardinals. We use Aczel’s trace encoding which is universally defined for any function type, regardless of being impredicative. Direct and concrete interpretations of simultaneous ind...
متن کاملThe Not So Simple Proof-Irrelevant Model of CC
It is well-known that the Calculus of Constructions (CC) bears a simple set-theoretical model in which proof-terms are mapped onto a single object—a property which is known as proof-irrelevance. In this paper, we show that when going into the (generally omitted) technical details, this naive model raises several unexpected difficulties related to the interpretation of the impredicative level, e...
متن کاملExtensional Normalization in the Logical Framework with Proof Irrelevant Equality
We extend the Logical Framework by proof irrelevant equality types and present an algorithm that computes unique long normal forms. The algorithm is inspired by normalization-by-evaluation. Equality proofs which are not reflexivity are erased to a single object ∗. The algorithm decides judgmental equality, its completeness is established by a PER model.
متن کاملOn Irrelevance and Algorithmic Equality in Predicative Type Theory
Dependently typed programs contain an excessive amount of static terms which are necessary to please the type checker but irrelevant for computation. To separate static and dynamic code, several static analyses and type systems have been put forward. We consider Pfenning’s type theory with irrelevant quantification which is compatible with a type-based notion of equality that respects η-laws. W...
متن کاملProof Transformation with Built-in Equality Predicate
One of the main reasons why computer generated proofs are not widely accepted is often their complexity and incomprehensibility. Especially proofs of mathematical theorems with equations are normally presented in an inadequate and not intuitive way. This is even more of a problem for the presentation of inferences drawn by automated reasoning components in other Al systems. For first order logi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2011
ISSN: 1860-5974
DOI: 10.2168/lmcs-7(4:5)2011